Provably Secure Encryption Schemes With Zero Setup and Linear Speed by Using Rubik’s Cubes
نویسندگان
چکیده
منابع مشابه
Artemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملProvably Secure LWE-Encryption with Uniform Secret
In this paper we present the (to the best of our knowledge) first LWE-based encryption scheme that removes the need of Gaussian sampling for the error, i.e. the discrete Gaussian distribution is replaced by the uniform distribution on a (small) set, which at the same time preserves the underlying worst-case hardness. This shows that provable security and efficiency do not necessarily have to mu...
متن کاملProvably Secure Blind Signature Schemes
In this paper, we give a provably secure design for blind signatures, the most important ingredient for anonymity in off-line electronic cash systems. Previous examples of blind signature schemes were constructed from traditional signature schemes with only the additional proof of blindness. The design of some of the underlying signature schemes can be validated by a proof in the so-called rand...
متن کاملOne-Way IND-CNA Key Setup - a Step Towards Provably Secure Symmetric Encryption
We analyse the consequences of the specific properties of the key-setup phase in symmetric encryption schemes for their security. We find that key-setup routines satisfying IND-CNA and one-wayness allow to construct schemes which are provably secure against key-recovery attacks. We propose a specific cryptosystem for which we show that the key-setup routine ensures a significant increase in the...
متن کاملTowards Provably Secure Efficiently Searchable Encryption
Traditional encryption systems are designed in such a way that either the whole datais decrypted, if the encryption and decryption keys match, or nothing is decryptedotherwise. However, there are applications that require a more flexible encryptionsystem which supports decrypting data partially. Searchable encryption is a tech-nique that provides functionalities to decrypt data ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3007335